Sequential Type-I Optimal Normal Basis Multiplier and Multiplicative Inverse in GF(2
نویسندگان
چکیده
This study presents a novel sequential Type-I optimal normal basis multiplier in GF(2) with a regular structure. The proposed multiplier has a slightly higher space complexity than the Reyhani-Masoleh-Hasan’s (RMH) multiplier, but is 27% faster than the RMH multiplier. Furthermore, the proposed multiplier is highly regular, modular, expandable and well-suited to VLSI implementation. A new normal basis inverter based on the proposed multiplier is also invented. The proposed inverter provides better time-area complexity than existing inverters as with large m.
منابع مشابه
An Efficient Optimal Normal Basis Type II Multiplier
ÐThis paper presents a new parallel multiplier for the Galois field GF 2m whose elements are represented using the optimal normal basis of type II. The proposed multiplier requires 1:5 m2 ÿm XOR gates, as compared to 2 m2 ÿm XOR gates required by the Massey-Omura multiplier. The time complexities of the proposed and the Massey-Omura multipliers are similar. Index TermsÐGalois field, optimal...
متن کاملA Low Complexity and a Low Latency Bit Parallel Systolic Multiplier over GF(2m) Using an Optimal Normal Basis of Type II
Using the self duality of an optimal normal basis (ONB) of type II, we present a bit parallel systolic multiplier over GF (2) which has a low hardware complexity and a low latency. We show that our multiplier has a latency m + 1 and the basic cell of our circuit design needs 5 latches (flip-flops). On the other hand, most of other multipliers of the same type have latency 3m and the basic cell ...
متن کاملA New Low Complexity Parallel Multiplier for a Class of Finite Fields
In this paper a new low complexity parallel multiplier for characteristic two finite fields GF (2) is proposed. In particular our multiplier works with field elements represented through both Canonical Basis and Type I Optimal Normal Basis (ONB), provided that the irreducible polynomial generating the field is an All One Polynomial (AOP). The main advantage of the scheme is the resulting space ...
متن کاملEfficient Linear Array for Multiplication in GF (2) Using a Normal Basis for Elliptic Curve Cryptography
We present a new sequential normal basis multiplier over GF (2). The gate complexity of our multiplier is significantly reduced from that of Agnew et al. and is comparable to that of Reyhani-Masoleh and Hasan, which is the lowest complexity normal basis multiplier of the same kinds. On the other hand, the critical path delay of our multiplier is same to that of Agnew et al. Therefore it is supp...
متن کاملEfficient Linear Array for Multiplication in GF(2m) Using a Normal Basis for Elliptic Curve Cryptography
We present a new sequential normal basis multiplier over GF (2). The gate complexity of our multiplier is significantly reduced from that of Agnew et al. and is comparable to that of Reyhani-Masoleh and Hasan, which is the lowest complexity normal basis multiplier of the same kinds. On the other hand, the critical path delay of our multiplier is same to that of Agnew et al. Therefore it is supp...
متن کامل